Support for linguistic macrofamilies from weighted sequence alignment
نویسندگان
چکیده
منابع مشابه
Support for linguistic macrofamilies from weighted sequence alignment.
Computational phylogenetics is in the process of revolutionizing historical linguistics. Recent applications have shed new light on controversial issues, such as the location and time depth of language families and the dynamics of their spread. So far, these approaches have been limited to single-language families because they rely on a large body of expert cognacy judgments or grammatical clas...
متن کاملSequence Alignment with Weighted Constraints
Given two sequences S1, S2 and a constrained sequence C, the longest common subsequence of S1, S2 with restriction to C is defined as the constrained longest common subsequence (CLCS) of S1, S2 and C. At the same time, the best alignment of S1, S2 with restriction to C is defined as the constrained pairwise sequence alignment (CPSA) of S1, S2 and C. Previous algorithms have shown that both CLCS...
متن کاملHow Emotional Support and Informational Support Relate to Linguistic Alignment
Linguistic alignment in text-based communication means that people tend to adjust their language use to one another both in terms of word choice and sentence structure. Previous studies about linguistic alignment suggested that these two forms of adaptation are correlated with each other, and that they build up to alignment at a higher representational level, such as pragmatic alignment for sup...
متن کاملNon-approximability of Weighted Multiple Sequence Alignment
We consider a weighted generalization of multiple sequence alignment with sumof-pair score. Multiple sequence alignment without weights is known to be NPcomplete and can be approximated within a constant factor, but it is unknown whether it has a polynomial time approximation scheme. Weighted multiple sequence alignment can be approximated within a factor of O(log n) where n is the number of se...
متن کاملNon-approximability of weighted multiple sequence alignment for arbitrary metrics
We prove that the multiple sequence alignment problem with weighted sum-of-pairs score is APX-hard for arbitrary metric scoring functions over the binary alphabet. This holds even when the weights are restricted to zero and one.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2015
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.1500331112